The Densest Hemisphere Problem
نویسندگان
چکیده
DD i j a n M73 1473 E D I T I O N O F 1 N O V 65 I S O B S O L E T E __________________U N C L A S S I F I E D _______________________ _ S E C U R I T Y C L A S S I F I C A T I O N O F T H I S P A G E (When Data Entered) SECURITY CLASSIFICATION OP THIS PAPE (When D a ta Entered) «
منابع مشابه
The Open University of Israel
The density of a graph G = (V,E) with edge capacities {c(e) : e ∈ E} is c(E)/|V |. Finding dense components in graphs is a major topic in graph theory algorithms. The most basic problem is the Densest Subgraph problem, that seeks a subgraph of maximum density. This problem can be solved in polynomial time, and we will give a systematic description of several polynomial time algorithms for this ...
متن کاملSDP-Hardness of Approximation for Densest k-subgraph
Densest k-subgraph is the problem of finding, giving a graph G and a number k, a k vertex subgraph of G with as many edges as possible. The best known poly-time algorithm for this problem gives a factor n1/4 approximation. Proving even constant factor hardness of approximation results for this problem has been done only with significantly stronger assumptions that P , NP. In 2011, however, Bhas...
متن کاملApproximation schemes, cliques, colors and densest subgraphs
In this thesis we study the problem of finding the densest k-subgraph of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, we study polynomial time algorithms for the densest k-subgraph problem on weighted graphs of maximal degree two, on weighted trees even if the solution is disconnected, and on interval...
متن کاملSolar cell efficiency enhancement using a hemisphere texture containing metal nanostructures
One major problem of the conventional solar cells is low conversion efficiency. In this work, we have proposed a new design including hemisphere texturing on top and metallic plasmonic nanostructure under the silicon layer to enhance the optical absorption inside the photosensitive layer. The finite-difference time-domain (FDTD) method has been used to investigate the interaction of light wi...
متن کاملApplications of Uniform Sampling: Densest Subgraph and Beyond
Recently [Bhattacharya et al., STOC 2015] [2] provide the first non-trivial algorithm for the densest subgraph problem in the streaming model with additions and deletions to its edges, i.e., for dynamic graph streams. They present a (0.5−ǫ)-approximation algorithm using Õ(n) space, where factors of ǫ and log(n) are suppressed in the Õ notation. However, the update time of this algorithm is larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 6 شماره
صفحات -
تاریخ انتشار 1978